A Description of the Subgraph Induced at a Labeling of a Graph by the Subset of Vertices with an Interval Spectrum

نویسندگان

  • Narine N. Davtyan
  • Arpine Khachatryan
  • Raffi R. Kamalian
چکیده

The sets of vertices and edges of an undirected, simple, finite, connected graph G are denoted by V (G) and E(G), respectively. An arbitrary nonempty finite subset of consecutive integers is called an interval. An injective mapping φ : E(G) → {1, 2, . . . , |E(G)|} is called a labeling of the graph G. If G is a graph, x is its arbitrary vertex, and φ is its arbitrary labeling, then the set SG(x, φ) ≡ {φ(e)/e ∈ E(G), e is incident with x} is called a spectrum of the vertex x of the graph G at its labeling φ. For any graph G and its arbitrary labeling φ, a structure of the subgraph of G, induced by the subset of vertices of G with an interval spectrum, is described. Mathematics Subject Classification: 05C15, 05C78

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The spectrum of the hyper-star graphs and their line graphs

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

متن کامل

The principal ideal subgraph of the annihilating-ideal graph of commutative rings

Let $R$ be a commutative ring with identity and $mathbb{A}(R)$ be the set   of ideals of $R$ with non-zero annihilators. In this paper, we first introduce and investigate the principal ideal subgraph of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_P(R)$. It is a (undirected) graph with vertices $mathbb{A}_P(R)=mathbb{A}(R)cap mathbb{P}(R)setminus {(0)}$, where   $mathbb{P}(R)$ is...

متن کامل

Labeling Subgraph Embeddings and Cordiality of Graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.  For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...

متن کامل

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

dominating subset and representation graph on topological spaces

Let a topological space. An intersection graph on a topological space , which denoted by ‎ , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of  and graph properties of ‎  are investigated. Also some classifications and representations for the graph ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1410.7927  شماره 

صفحات  -

تاریخ انتشار 2014